Erratum to: Linear covering codes and error-correcting codes for limited-magnitude errors
نویسندگان
چکیده
منابع مشابه
Erratum to: Linear covering codes and error-correcting codes for limited-magnitude errors
The expression for ω 2,2,r (2t) in Theorem 9 is misprinted in the original publication of this article. It should have been the same as for ω 2,1,r (2t) in Theorem 11. The correct expression in Theorem 9 will be Theorem 9 For q = 2t where t is odd, we have ω 2,2,r (2t) = 1 2 (2 r − 1)(t r + 1) .
متن کاملLinear covering codes and error-correcting codes for limited-magnitude errors
The concepts of a linear covering code and a covering set for the limitedmagnitude-error channel are introduced. A number of covering-set constructions, as well as some bounds, are given. In particular, optimal constructions are given for some cases involving small-magnitude errors. A problem of Stein is partially solved for these cases. Optimal packing sets and the corresponding error-correcti...
متن کاملSome codes correcting single symmetric errors of limited magnitude
An error model with symmetric errors of limited magnitude is considered. Limited magnitude means that the size of any error is limited by a number smaller (usually much smaller) than the alphabet size. Several constructions of codes correcting single error are given. In some cases, the codes are perfect or quasi-perfect.
متن کاملLinear Error - Correcting Codes Lecturer : Michel Goemans 1 Linear Error Correcting Codes
We wish to transmit a message (represented in bits) to a destination through a channel reliably. Errors may occur during transmission and we hope to detect and correct these transmitted errors. In order to do so, we must introduce some redundancy in our transmitted message. We saw that Shannon’s Noisy Coding Theorem tells us that if the redundancy is above a certain level (constrained by the no...
متن کاملHamming codes and some theory of linear error correcting codes
The topic is how to reduce the error of communication in the presence of noise. Block encoding is an expansion function from a block of plaintext alphabet symbols to a block of communication alphabet symbols where the block lengths are k and n respectively, and k ≤ n. Without loss of generality we consider both alphabets to be bit strings. The notation for an i length bit string is σ ∈ { 0, 1 }...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2014
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-014-9991-z